Matching points with disks with a common intersection
نویسندگان
چکیده
منابع مشابه
Intersection Type Matching with Subtyping
Type matching problems occur in a number of contexts, including library search, component composition, and inhabitation. We consider the intersection type matching problem under the standard notion of subtyping for intersection types: Given intersection types τ and σ, where σ is a constant type, does there exist a type substitution S such that S(τ) is a subtype of σ? We show that the matching p...
متن کاملMatching Points with Things
Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their number is at most 2. When the objects are line segments,...
متن کاملMatching Points with Squares
Given a class C of geometric objects and a point set P , a C-matching of P is a set M = {C1, . . . , Ck} ⊆ C of elements of C such that each Ci contains exactly two elements of P and each element of P lies in at most one Ci. If all of the elements of P belong to some Ci, M is called a perfect matching. If, in addition, all of the elements of M are pairwise disjoint, we say that this matching M ...
متن کاملCovering moving points with anchored disks
Consider a set of mobile clients represented by n points in the plane moving at constant speed along n different straight lines. We study the problem of covering all mobile clients using a set of k disks centered at k fixed centers. Each disk exists only at one instant and while it does, covers any client within its coverage radius. The task is to select an activation time and a radius for each...
متن کاملCovering Points with Disjoint Unit Disks
We consider the following problem. How many points must be placed in the plane so that no collection of disjoint unit disks can cover them? The answer, k, is already known to satisfy 11 ≤ k ≤ 53. Here, we improve the lower bound to 13 and the upper bound to 50. We also provide a set of 45 points that apparently cannot be covered, although this has been determined via computer search.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.03.003